Exploiting Causal Independence Using Weighted Model Counting
نویسندگان
چکیده
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be an effective method for exact inference in Bayesian networks. In this paper, we present techniques for improving this approach for Bayesian networks with noisy-OR and noisy-MAX relations—two relations which are widely used in practice as they can dramatically reduce the number of probabilities one needs to specify. In particular, we present two space efficient CNF encodings for noisyOR/MAX and explore alternative search ordering heuristics. We experimentally evaluated our techniques on large-scale real and randomly generated Bayesian networks. On these benchmarks, our techniques gave speedups of up to two orders of magnitude over the best previous approaches and scaled up to networks with larger numbers of random variables.
منابع مشابه
Exploiting Causal Independence in Markov Logic Networks: Combining Undirected and Directed Models
A new method is proposed for compiling causal independencies into Markov logic networks. A Markov logic network can be viewed as compactly representing a factorization of a joint probability into the multiplication of a set of factors guided by logical formulas. We present a notion of causal independence that enables one to further factorize the factors into a combination of even smaller factor...
متن کاملOn the Impact of Junction-Tree Topology on Weighted Model Counting
We present and evaluate the power of a new framework for weighted model counting and inference in graphical models, based on exploiting the topology of the junction tree representing the formula. The proposed approach uses the junction tree topology in order to craft a reduced set of partial assignments that are guaranteed to decompose the formula. We show that taking advantage of the junction ...
متن کاملIndependence of Causal In uence and Clique Tree Propagation
This paper explores the role of independence of causal in uence (ICI) in Bayesian network inference. ICI allows one to factorize a conditional probability table into smaller pieces. We describe a method for exploiting the factorization in clique tree propagation (CTP) | the state-of-the-art exact inference algorithm for Bayesian networks. We also present empirical results showing that the resul...
متن کاملA Factorized Representation of Independence of Causal Influence and Lazy Propagation
The efficiency of algorithms for probabilistic inference in Bayesian networks can be improved by exploiting independence of causal influence. The factorized representation of independence of causal influence offers a factorized decomposition of certain independence of causal influence models. We describe how lazy propagation a junction tree based inference algorithm easily can be extended to ta...
متن کاملA Factorized Representation of Independence of Causal In uence and Lazy Propagation
The eeciency of algorithms for probabilistic inference in Bayesian networks can be improved by exploiting independence of causal innuence. The factorized representation of independence of causal innuence ooers a factorized decomposition of certain independence of causal innuence models. We describe how lazy propagation a junction tree based inference algorithm-easily can be extended to take adv...
متن کامل